|
In computability theory, productive sets and creative sets are types of sets of natural numbers that have important applications in mathematical logic. They are a standard topic in mathematical logic textbooks such as and . ==Definition and example== For the remainder of this article, assume that is an acceptable numbering of the computable functions and ''W''''i'' the corresponding numbering of the recursively enumerable sets. A set ''A'' of natural numbers is called productive if there exists a total recursive (computable) function so that for all , if then The function is called the productive function for A set ''A'' of natural numbers is called creative if ''A'' is recursively enumerable and its complement is productive. Not every productive set has a recursively enumerable complement, however, as illustrated below. The archetypal creative set is , the set representing the halting problem. Its complement is productive with productive function ''f''(''i'') = ''i'' (the identity function). To see this, we apply the definition of productivity function and show separately that and : * : suppose , then , now given that we have , this leads to a contradiction. So . * : in fact if , then it would be true that , but we have demonstrated the contrary in the previous point. So . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Creative and productive sets」の詳細全文を読む スポンサード リンク
|